Shallow Semantics with Shallow Syntax

نویسنده

  • Nimar S. Arora
چکیده

Assigning semantic roles to the constituents of a natural language sentence is an important first step in translating natural language into a logical form for further processing. I present a statistical classifier which can perform this task using minimal syntactic cues. I use the syntactic and the semantic head of each constituent as the only features and present simple rules for extracting these heads. I also show how a hierarchical tree of semantic roles can be exploited to better estimate the probabilities in the model. On the FrameNet 1.3 corpus, my system can label pre-segmented constituents with an accuracy of 79.6%.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-based RMRS Construction from Shallow Grammars

We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth – ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed fe...

متن کامل

Constraint-based RMRS Construction from Shallow Grammars

Semantic formalisms such as MRS [Copestake et al., 2003], UDRT [Reyle, 1993], or CLLS [Egg et al., 2001] provide elegant solutions for the treatment of semantic ambiguities in terms of underspecification. These semantic formalisms are not constrained to specific syntactic frameworks. MRS, for example, is mainly used with HPSG grammars, but may also be built from LFG grammars using co-descriptio...

متن کامل

Epistemic models of shallow depths and decision making in games: Horticulture

Kaneko-Suzuki developed epistemic logics of shallow depths with multiple players for investigations of game theoretical problems. By shallow depth, we mean that nested occurrences of belief operators of players in formulae are restricted, typically to be of finite depths, by a given epistemic structure. In this paper, we develop various methods of surgical operations (cut and paste) of epistemi...

متن کامل

Combining Deep and Shallow Embedding for EDSL

When compiling embedded languages it is natural to use an abstract syntax tree to represent programs. This is known as a deep embedding and it is a rather cumbersome technique compared to other forms of embedding, typically leading to more code and being harder to extend. In shallow embeddings, language constructs are mapped directly to their semantics which yields more flexible and succinct im...

متن کامل

Combining deep and shallow embedding of domain-specific languages

When compiling embedded languages it is natural to use an abstract syntax tree to represent programs. This is known as a deep embedding and it is a rather cumbersome technique compared to other forms of embedding, typically leading to more code and being harder to extend. In shallow embeddings, language constructs are mapped directly to their semantics which yields more flexible and succinct im...

متن کامل

MetaQuerier over the Deep Web: Shallow Integration across Holistic Sources

The Web has been rapidly “deepened” by myriad searchable databases online. To enable effective access to the “deep Web,” we are building the MetaQuerier– for exploring and integrating databases on the Web. Such metaquerying must tackle integration at a large scale (as sources are proliferating online) and of a dynamic nature (as each query will access different sources). Toward such integration...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007